TSTP Solution File: SEV485^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV485^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:43:22 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 30 ( 9 unt; 11 typ; 0 def)
% Number of atoms : 71 ( 21 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 105 ( 5 ~; 3 |; 5 &; 92 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 23 ( 0 ^ 18 !; 0 ?; 23 :)
% ( 5 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/nums/num': $tType ).
thf(func_def_0,type,
'type/nums/num': $tType ).
thf(func_def_1,type,
'const/sets/UNIV':
!>[X0: $tType] : ( X0 > $o ) ).
thf(func_def_2,type,
'const/sets/HAS_SIZE':
!>[X0: $tType] : ( ( X0 > $o ) > 'type/nums/num' > $o ) ).
thf(func_def_3,type,
'const/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_4,type,
'const/sets/CARD':
!>[X0: $tType] : ( ( X0 > $o ) > 'type/nums/num' ) ).
thf(func_def_5,type,
'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_6,type,
'const/nums/BIT1': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_7,type,
'const/nums/BIT0': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_8,type,
'const/nums/_0': 'type/nums/num' ).
thf(func_def_15,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f31,plain,
$false,
inference(subsumption_resolution,[],[f30,f14]) ).
thf(f14,plain,
( ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o )
!= $true ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o )
!= $true ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
~ ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o,
file('/export/starexec/sandbox2/tmp/tmp.d7BQSMua2K/Vampire---4.8_31648','thm/sets/FINITE_BOOL_') ).
thf(f30,plain,
( ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o )
= $true ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
( ( $false = $true )
| ( ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o )
= $true ) ),
inference(superposition,[],[f15,f19]) ).
thf(f19,plain,
! [X0: $tType,X2: 'type/nums/num',X1: X0 > $o] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $false )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f17,plain,
! [X0: $tType,X2: 'type/nums/num',X1: X0 > $o] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $false )
| ( ( ( 'const/sets/FINITE' @ X0 @ X1 )
& ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
! [X0: $tType,X2: 'type/nums/num',X1: X0 > $o] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= ( ( 'const/sets/FINITE' @ X0 @ X1 )
& ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= ( ( 'const/sets/FINITE' @ X0 @ X1 )
& ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 ) )
& ( 'const/sets/FINITE' @ X0 @ X1 ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 ) )
& ( 'const/sets/FINITE' @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.d7BQSMua2K/Vampire---4.8_31648','thm/sets/HAS_SIZE_') ).
thf(f15,plain,
( ( 'const/sets/HAS_SIZE' @ $o @ 'const/sets/UNIV' @ $o @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT0' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) )
= $true ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ( 'const/sets/HAS_SIZE' @ $o @ 'const/sets/UNIV' @ $o @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT0' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) )
= $true ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
'const/sets/HAS_SIZE' @ $o @ 'const/sets/UNIV' @ $o @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT0' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
'const/sets/HAS_SIZE' @ $o @ 'const/sets/UNIV' @ $o @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT0' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.d7BQSMua2K/Vampire---4.8_31648','thm/sets/HAS_SIZE_BOOL_') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV485^1 : TPTP v8.1.2. Released v7.0.0.
% 0.06/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 11:59:12 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH1_THM_EQU_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.d7BQSMua2K/Vampire---4.8_31648
% 0.14/0.37 % (31860)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.14/0.38 % (31860)Instruction limit reached!
% 0.14/0.38 % (31860)------------------------------
% 0.14/0.38 % (31860)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (31860)Termination reason: Unknown
% 0.14/0.38 % (31860)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (31860)Memory used [KB]: 5373
% 0.14/0.38 % (31860)Time elapsed: 0.003 s
% 0.14/0.38 % (31860)Instructions burned: 2 (million)
% 0.14/0.38 % (31860)------------------------------
% 0.14/0.38 % (31860)------------------------------
% 0.14/0.39 % (31857)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.14/0.39 % (31858)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.14/0.39 % (31859)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.14/0.39 % (31863)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.14/0.39 % (31861)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.14/0.39 % (31862)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.14/0.39 % (31864)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.14/0.39 % (31861)Instruction limit reached!
% 0.14/0.39 % (31861)------------------------------
% 0.14/0.39 % (31861)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (31861)Termination reason: Unknown
% 0.14/0.39 % (31861)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (31861)Memory used [KB]: 895
% 0.14/0.39 % (31861)Time elapsed: 0.004 s
% 0.14/0.39 % (31861)Instructions burned: 2 (million)
% 0.14/0.39 % (31861)------------------------------
% 0.14/0.39 % (31861)------------------------------
% 0.14/0.39 % (31862)Refutation not found, incomplete strategy
% 0.14/0.39 % (31862)------------------------------
% 0.14/0.39 % (31862)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (31862)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (31862)Memory used [KB]: 5373
% 0.14/0.39 % (31862)Time elapsed: 0.004 s
% 0.14/0.39 % (31862)Instructions burned: 1 (million)
% 0.14/0.39 % (31862)------------------------------
% 0.14/0.39 % (31862)------------------------------
% 0.14/0.39 % (31857)First to succeed.
% 0.14/0.39 % (31869)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on Vampire---4 for (2999ds/37Mi)
% 0.14/0.39 % (31859)Also succeeded, but the first one will report.
% 0.14/0.39 % (31864)Instruction limit reached!
% 0.14/0.39 % (31864)------------------------------
% 0.14/0.39 % (31864)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (31864)Termination reason: Unknown
% 0.14/0.39 % (31864)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (31864)Memory used [KB]: 5500
% 0.14/0.39 % (31864)Time elapsed: 0.006 s
% 0.14/0.39 % (31864)Instructions burned: 3 (million)
% 0.14/0.39 % (31864)------------------------------
% 0.14/0.39 % (31864)------------------------------
% 0.14/0.39 % (31857)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for Vampire---4
% 0.14/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.14/0.39 % (31857)------------------------------
% 0.14/0.39 % (31857)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (31857)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (31857)Memory used [KB]: 5500
% 0.14/0.39 % (31857)Time elapsed: 0.006 s
% 0.14/0.39 % (31857)Instructions burned: 2 (million)
% 0.14/0.39 % (31857)------------------------------
% 0.14/0.39 % (31857)------------------------------
% 0.14/0.39 % (31854)Success in time 0.028 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------